Second-Order Type Isomorphisms Through Game Semantics

نویسنده

  • Joachim De Lataillade
چکیده

The characterization of second-order type isomorphisms is a purely syntactical problem that we propose to study under the enlightenment of game semantics. We study this question in the case of second-order λμ-calculus, which can be seen as an extension of system F to classical logic, and for which we define a categorical framework: control hyperdoctrines. Our game model of λμ-calculus is based on polymorphic arenas (closely related to Hughes’ hyperforests) which evolve during the play (following the ideas of Murawski-Ong). We show that type isomorphisms coincide with the "equality" on arenas associated with types. Finally we deduce the equational characterization of type isomorphisms from this equality. We also recover from the same model Roberto Di Cosmo’s characterization of type isomorphisms for system F. This approach leads to a geometrical comprehension on the question of second order type isomorphisms,which can be easily extended to some other polymorphic calculi including additional programming features.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Game semantics for first-order logic

We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style extension of Parigot’s lambda-mu-calculus to represent proofs of first-order classical logic. We present some relations with Krivine’s classical realizability and applications to type isomorphisms.

متن کامل

Curry-style type Isomorphisms and Game Semantics

Curry-style system F, i.e. system F with no explicit types in terms, can be seen as a core presentation of polymorphism from the point of view of programming languages. This paper gives a characterisation of type isomorphisms for this language, by using a game model whose intuition comes both from the syntax and fromthe game semantics universe. Themodel is composed of: an untyped part to interp...

متن کامل

Classical isomorphisms of types

The study of isomorphisms of types has been mainly carried out in an intuitionistic setting. We extend some of these works to classical logic for both call-by-name and call-by-value computations by means of polarized linear logic and game semantics. This leads to equational characterizations of these isomorphisms for all the propositional connectives.

متن کامل

Team building in dependence

Hintikka and Sandu’s Independence-Friendly Logic was introduced as a logic for partially ordered quantification, in which the independence of (existential) quantifiers from previous (universal) quantifiers is written by explicit syntax. It was originally given a semantics by games of imperfect information; Hodges then gave a (necessarily) second-order Tarskian semantics. More recently, Väänänen...

متن کامل

Expressing Second Order Semantics and the Emergence of Recursion

Although most previous model-based research has not moved beyond first-order semantics, human languages are clearly capable of expressing second-order semantics: the meanings expressed in a sentence do not only consist of conjunctions of first-order predicates but also predicates that take other predicates as an argument. In this paper we report on multi-agent language game experiments in which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 151  شماره 

صفحات  -

تاریخ انتشار 2008